Download Sound Analysis and Synthesis Adaptive in Time and Two Frequency Bands We present an algorithm for sound analysis and resynthesis with local automatic adaptation of time-frequency resolution. There exists several algorithms allowing to adapt the analysis window depending on its time or frequency location; in what follows we propose a method which select the optimal resolution depending on both time and frequency. We consider an approach that we denote as analysis-weighting, from the point of view of Gabor frame theory. We analyze in particular the case of different adaptive timevarying resolutions within two complementary frequency bands; this is a typical case where perfect signal reconstruction cannot in general be achieved with fast algorithms, causing a certain error to be minimized. We provide examples of adaptive analyses of a music sound, and outline several possibilities that this work opens.
Download Accelerating Matching Pursuit for Multiple Time-Frequency Dictionaries Matching pursuit (MP) algorithms are widely used greedy methods to find K-sparse signal approximations in redundant dictionaries. We present an acceleration technique and an implementation
of the matching pursuit algorithm acting on a multi-Gabor dictionary, i.e., a concatenation of several Gabor-type time-frequency
dictionaries, consisting of translations and modulations of possibly different windows, time- and frequency-shift parameters. The
proposed acceleration is based on pre-computing and thresholding
inner products between atoms and on updating the residual directly
in the coefficient domain, i.e., without the round-trip to the signal domain. Previously, coefficient-domain residual updates have
been dismissed as having prohibitive memory requirements. By
introducing an approximate update step, we can overcome this restriction and greatly improve the performance of matching pursuit
at a modest cost in terms of approximation quality per selected
atom. An implementation in C with Matlab and GNU Octave interfaces is available, outperforming the standard Matching Pursuit
Toolkit (MPTK) by a factor of 3.5 to 70 in the tested conditions.
Additionally, we provide experimental results illustrating the convergence of the implementation.